Date: Tue, 10 Dec 1996 03:21:46 GMT
Server: NCSA/1.4.2
Content-type: text/html

<html>

<head>
	<title>Chaotic People</title>
</head>

<body>
<!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><!WA0><img src=http://www.cs.washington.edu/research/projects/lis/chaos/www/chaos.xbm> <p>

<h1> <a name="top"> Chaotic People</a><br>
 <em><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><!WA1><a href="http://www.cs.indiana.edu/finger/gateway?chaos@cs.washington.edu">chaos@cs.washington.edu</a></em>
</h1>


<address>     
     <!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><!WA2><a href="http://www.cs.washington.edu/">Computer Science & Engineering Department</a> <br> 
     <!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><!WA3><a href="http://www.washington.edu/">University of Washington,</a><br>
     Box 352350<br>
     <!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><!WA4><a href="http://www.cs.washington.edu/area/">Seattle, WA</a> 98195-2350 USA
</address>

<hr> <p>

<h2>Who's who in Chaos:</h2>

<p> The Chaos Router is a Non-Minimal Adaptive Packet Router which
uses randomization to probabilistically avoid livelock.  The concept
of chaotic routing was invented by Smaragda Konstantinidou and <!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><!WA5><a
href="http://www.cs.washington.edu/people/faculty/snyder.html">
Lawrence Snyder </a> in 1990.  In 1993, a design team led by <!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><!WA6><a
href="http://www.cs.washington.edu/homes/kwb"> Kevin Bolding </a>
built the first <!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><!WA7><a href="http://www.cs.washington.edu/research/projects/lis/chaos/www/chip.html"> Chaos Router chip </a> with the
help of lots of people, including 
Sen-Ching Cheung, 
<!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><!WA8><a href="http://www.cs.washington.edu/homes/sungeun"> Sung-Eun Choi  </a>,
<!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><!WA9><a href="http://www.cs.washington.edu/people/faculty/ebeling.html"> Carl Ebeling </a>,
<!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><!WA10><a href="http://www.cs.washington.edu/homes/soha"> Soha Hassoun  </a>,
Ton Ngo, and Robert Wille.

<!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><!WA11><a href="http://www.cs.washington.edu/homes/mckenzie"> Neil McKenzie </a>
finished a network interface design that provides low latency access
for User-Level messages.<p>

In addition to building hardware, our group has been studying routing
in general.  We have implemented a simulator with capabilities for
real-time visualization to study Chaos and other routing techniques.
In particular, our simulator can vary many different characteristics
including routing algorithm, buffer size, message lengths and
switching technique to name a few.  <!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><!WA12><a
href="http://www.cs.washington.edu/homes/sungeun"> Sung-Eun Choi</a>,
created the graphical interface.
<!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><!WA13><a href="http://www.cs.washington.edu/homes/mel">
Melanie Fulgham </a> has studied many aspects of Chaotic routing with
<!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><!WA14><a
href="ftp://shrimp.cs.washington.edu/pub/chaos/docs/UW-CSE-93-06-01.PS.Z">
non-uniform </a> traffic loads. 
<!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><!WA15><a href="http://www.cs.washington.edu/homes/thu"> Thu Nguyen </a> has
experimented with minimal adaptive routing algorithms.

<p>

Our group is also interested in theoretical research in routing.
<!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><!WA16><a href="http://www.cs.washington.edu/homes/dci"> Donald Chinn </a>,
 et al. proved a lower bound on minimal adaptive
routing on a mesh with bounded queue size.
<p>
<address>
kwb@cs.washington.edu
</address>

</body>
</html>
